Multi-Robot Path Planning Method Using Reinforcement Learning
نویسندگان
چکیده
منابع مشابه
Multi-robot Formation Control Using Reinforcement Learning Method
Formation is a good example of the research for multi-robot cooperation. Many different ways can be used to accomplish this task, but the main drawbacks of most of these methods are that robots can’t self-learn. In Brooks’ behavioral opinion, this paper is to verify that the reinforcement learning method can be used for robots to select different behaviors in various different situations. Exper...
متن کاملUsing Reinforcement Learning in Multi-Robot SLAM
Truly autonomous mobile robots require the ability to map their environment using ‘Simultaneous Localization and Mapping’ SLAM in order to explore it without getting lost. Multi-robot SLAM becomes necessary once an environment becomes too large. This thesis focuses on the determination of when a robot should merge its maps with another robot’s upon rendezvous. This decision should be based on t...
متن کاملCombining Planning with Reinforcement Learning for Multi-robot Task Allocation
We describe an approach to the multi-robot task allocation (MRTA) problem in which a group of robots must perform tasks that arise continuously, at arbitrary locations across a large space. A dynamic scheduling algorithm is derived in which proposed plans are evaluated using a combination of short-term lookahead and a value function acquired by reinforcement learning. We demonstrate that this d...
متن کاملCooperative Multi-Robot Path Planning
In risky applications it is advantageous to use multiple robots in order to improve performances. In a research or patrol scenario robots have to move cooperatively in order to avoid collisions and to improve performance. In this paper we describe the implementation of two variations of a cooperative planning algorithm: Cooperative A* and Cooperative Voronoi A*. The task is decoupled into a ser...
متن کاملRobot Path Planning Using Cellular Automata and Genetic Algorithm
In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Sciences
سال: 2019
ISSN: 2076-3417
DOI: 10.3390/app9153057